Max - Planck - Institut für Informatik Computer Graphics Group Saarbrücken , Germany Digital Art of Bas - Relief Sculpting
نویسندگان
چکیده
In this thesis, we present a semi-automatic method for the generation of bas-reliefs from a given shape. A Bas-reliefs is an artistic sculptural representation of a three dimensional scene which possesses a negligible depth. The main idea behind our method is to work with a range image, whose depth interval size is compressed in a feature preserving way. Our approach operates in the gradient domain, whereas we also present an extension which works on the Laplacian. The algorithm relies on the achievements of High-Dynamic-RangeCompression and adapts necessary elements to our purpose. We manipulate the partial derivatives of the range image rather than the image data itself. These derivatives are compressed by applying an attenuation function which leads to a relative convergence of the entries. By a feature enhancing technique we boost small details in order to keep them perceivable in the result. In the end, the compressed and enhanced partial derivatives are recombined to the final bas-relief. The results exhibit a very small depth range but still contain perceptually important details. A user can specify the desired compression ratio and steer the relevance of small features in the outcome. The approach is intuitive, fast and works very well for high compression ratios as experiments have shown. Possible applications are of artistic nature like sculpting, embossment, engraving or carving.
منابع مشابه
Max - Planck - Institut für Informatik Computer Graphics Group Saarbrücken , Germany Advanced Shadow Map Parameterization Diploma
متن کامل
Max - Planck - Institut für Informatik Computer Graphics Group Saarbrücken , Germany Advanced Shadow Map Parameterization
متن کامل
A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
We present the first combinatorial polynomial time algorithm for computing the equilibrium of the Arrow-Debreu market model with linear utilities. Our algorithm views the allocation of money as flows and iteratively improves the balanced flow as in [Devanur et al. 2008] for Fisher’s model. We develop new methods to carefully deal with the flows and surpluses A preliminary version of this paper ...
متن کاملImproved Bounds and Schemes for the Declustering Problem
The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed on the devices. Using deep results from discrepancy theory, we improve previous work of several authors concerning range queries to higher-dimensional data. We give a declustering scheme with an additive error of Od(log d−1 M) independe...
متن کاملShape Interrogation
1 Laboratoire Jean Kuntzmann, Institut National Polytechnique de Grenoble, France [email protected] 2 MPII, Max Planck Institut für Informatik, Saarbrücken, Germany [email protected] 3 INRIA Sophia-Antipolis, France [email protected], [email protected], [email protected] 4 Technion Israel Institute of Technology, Haifa 32000, Israel [email protected]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007